Towards Book Cover Design via Layout Graphs
نویسندگان
چکیده
Book covers are intentionally designed and provide an introduction to a book. However, they typically require professional skills design produce the cover images. Thus, we propose generative neural network that can book based on easy-to-use layout graph. The graph contains objects such as text, natural scene objects, solid color spaces. This is embedded using convolutional then used with mask proposal generator bounding-box filled object generator. Next, compiled into single image entire trained combination of adversarial training, perceptual reconstruction. Finally, Style Retention Network (SRNet) transfer learned font style onto desired text. Using proposed method allows for easily controlled unique covers.
منابع مشابه
Bounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملTowards nanoimprint lithography-aware layout design checking
Just as the simulation of photolithography has enabled resolution-enhancement through Optical Proximity Correction, the physical simulation of nanoimprint lithography is needed to guide the design of products that will use this process. We present an extremely fast method for simulating thermal nanoimprint lithography. The technique encapsulates the resist’s mechanical behavior using an analyti...
متن کاملbounding cochordal cover number of graphs via vertex stretching
it is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (castelnuovo-mumford) regularity. as a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph g are equal provided g is well-covered bipa...
متن کاملBook Cover Recognition
Here we developed a MATLAB based Graphical User Interface for people to check the information of desired books in real-time. The GUI allows user to take photos of the book cover. Then it will automatically detect features of the input image based on MSER algorithm, then it will filter out non-text features based on morphological difference between text and non-text regions. In order to further ...
متن کاملTowards optimal kernel for connected vertex cover in planar graphs
We study the parameterized complexity of the connected version of the vertex cover problem, where the solution set has to induce a connected subgraph. Although this problem does not admit a polynomial kernel for general graphs (unless NP ⊆ coNP/poly), for planar graphs Guo and Niedermeier [ICALP’08] showed a kernel with at most 14k vertices, subsequently improved by Wang et al. [MFCS’11] to 4k....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-86334-0_42